Neuro-evolution in Zero-Sum Perfect Information Games on the Android OS
نویسندگان
چکیده
منابع مشابه
Information Relaxations and Dynamic Zero-Sum Games
Dynamic zero-sum games are an important class of problems with applications ranging from evasion-pursuit and heads-up poker to certain adversarial versions of control problems such as multi-armed bandit and multiclass queuing problems. These games are generally very difficult to solve even when one player’s strategy is fixed, and so constructing and evaluating good sub-optimal policies for each...
متن کاملAlgorithms for uniform optimal strategies in two-player zero-sum stochastic games with perfect information
In stochastic games with perfect information, in each state at most one player has more than one action available. We propose two algorithms which find the uniform optimal strategies for zero-sum two-player stochastic games with perfect information. Such strategies are optimal for the long term average criterion as well. We prove the convergence for one algorithm, which presents a higher comple...
متن کاملTowards a Characterization of Chance in Games The Case of Two-Player Zero-Sum Games with Perfect Information
The distinction between games of chance and games of skill is not well-defined at present. We introduce the concept of chanciness for non-deterministic two-player zero-sum games with sequential moves and perfect information. chanciness quantifies how strongly a game is influenced by chance events. We demonstrate that the relative influence of chance on game outcomes varies with the skill of the...
متن کاملEvaluation of Economy in a Zero-sum Perfect Information Game
A zero-sum perfect information game is one where every player knows all the moves. Chess is a good example where the object is to checkmate or capture the enemy king. One important feature of checkmates, especially in chess problem composition, is economy. This paper proposes a computational function to evaluate the economy of checkmate configurations on the chessboard. Several experiments were...
متن کاملA policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information
We give a policy-improvement type algorithm to locate an optimal pure stationary strategy for discounted stochastic games with perfect information. A graph theoretic motivation for our algorithm is presented as well.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of West University of Timisoara - Mathematics
سال: 2012
ISSN: 1841-3293
DOI: 10.2478/v10324-012-0013-4